Classification on the Average of Random Walks

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Classification on the average of random walks

We introduce a new method for studying large scale properties of random walks. The new concepts of transience and recurrence on the average are compared with the ones introduced in [1] and with the usual ones; their relationships are analyzed and various examples are provided.

متن کامل

Average persistence of random walks

– We study the first passage time properties of an integrated Brownian curve both in homogeneous and disordered environments. In a disordered medium we relate the scaling properties of this center-of-mass persistence of a random walker to the average persistence, the latter being the probability Ppr(t) that the expectation value 〈x(t)〉 of the walker’s position after time t has not returned to t...

متن کامل

A PRELUDE TO THE THEORY OF RANDOM WALKS IN RANDOM ENVIRONMENTS

A random walk on a lattice is one of the most fundamental models in probability theory. When the random walk is inhomogenous and its inhomogeniety comes from an ergodic stationary process, the walk is called a random walk in a random environment (RWRE). The basic questions such as the law of large numbers (LLN), the central limit theorem (CLT), and the large deviation principle (LDP) are ...

متن کامل

A Random Walks Method for Text Classification

Practical text classification system should be able to utilize information from both expensive labelled documents and large volumes of cheap unlabelled documents. It should also easily deal with newly input samples. In this paper, we propose a random walks method for text classification, in which the classification problem is formulated as solving the absorption probabilities of Markov random w...

متن کامل

Partially labeled classification with Markov random walks

To classify a large number of unlabeled examples we combine a limited number of labeled examples with a Markov random walk representation over the unlabeled examples. The random walk representation exploits any low dimensional structure in the data in a robust, probabilistic manner. We develop and compare several estimation criteria/algorithms suited to this representation. This includes in par...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal of Statistical Physics

سال: 2004

ISSN: 0022-4715

DOI: 10.1023/b:joss.0000012513.55697.65